INCREMENTAL FILTERING ALGORITHMS FOR PRECEDENCE AND DEPENDENCY CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
Algorithms for Deterministic Incremental Dependency Parsing
Parsing algorithms that process the input from left to right and construct a single derivation have often been considered inadequate for natural language parsing because of the massive ambiguity typically found in natural language grammars. Nevertheless, it has been shown that such algorithms, combined with treebank-induced classifiers, can be used to build highly accurate disambiguating parser...
متن کاملFiltering Algorithms for Tabular Constraints
Constraint satisfaction technology supports all constraint types, i.e. arbitrary relations can be expressed, theoretically. However, in practice constraint packages support only some constraints, namely arithmetical, logical, and special purpose global constraints. If a general relation constraint needs to be expressed, the user is forced to represent it as a system of supported constraints or ...
متن کاملGlobal Constraints and Filtering Algorithms
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldiff and the global cardinal...
متن کاملIncremental Algorithms for Managing Temporal Constraints
This paper addresses the problem of eeciently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a sub...
متن کاملApproximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2008
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s0218213008003856